I am a fifth-year PhD student at Duke University. My research interest is graph algorithms of theoretical computer science. I am fortunate to be advised by Prof. Debmalya Panigrahi.
The goal of my research is to design efficient graph algorithms that are close to linear time, in response to the explosive growth in the size of modern networks. My past research is focused on problems related to graph connectivity and network reliability. I am also interested in bridging the gap between directed and undirected graph algorithms.
Prior to that, I received my bachelor degree from Yao Class at Tsinghua University.
Contact info:
ruoxu.cen [at] duke.edu
Ruoxu Cen, Henry Fleischmann, George Z. Li, Jason Li, Debmalya Panigrahi.
Fast Algorithms for Graph Arboricity and Related Problems. [arXiv]
To appear in FOCS 2025
Ruoxu Cen, Jason Li, Debmalya Panigrahi.
Network Unreliability in Almost Linear Time. [ACM] [arXiv]
STOC 2025
Ruoxu Cen, Jason Li, Debmalya Panigrahi.
Hypergraph Unreliability in Quasi-Polynomial Time. [ACM] [arXiv]
STOC 2024
Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi.
Beyond the Quadratic Time Barrier for Network Unreliability. [SIAM] [arXiv]
SODA 2024
Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi.
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. [SIAM] [arXiv]
SODA 2023
Ruoxu Cen, Jason Li, Debmalya Panigrahi.
Edge Connectivity Augmentation in Near-Linear Time. [ACM] [arXiv]
STOC 2022
Ruoxu Cen, Jason Li, Debmalya Panigrahi.
Augmenting Edge Connectivity via Isolating Cuts. [SIAM] [arXiv]
SODA 2022
Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, and Thatchaphol Saranurak.
Minimum Cuts in Directed Graphs via Partial Sparsification. [arXiv]
FOCS 2021
Ruoxu Cen, Yu Cheng, Debmalya Panigrahi, Kevin Sun.
Sparsification of Directed Graphs via Cut Balance. [pdf]
ICALP 2021
Ruoxu Cen, Ran Duan, Yong Gu.
Roundtrip Spanners with (2k-1) Stretch. [pdf]
ICALP 2020